Common Knowledge as a Coinductive Modality

نویسندگان

  • VENANZIO CAPRETTA
  • Henk Barendregt
  • Robert Aumann
چکیده

I prove in Coq Aumann’s Theorem: In perfect information games, common knowledge of rationality implies backward induction equilibrium. The notion of common knowledge is formalized, using a coinductive definition, as a modality containing an infinite amount of information. 1. The Green-Eyed Amazons In the land of the Amazons a strange taboo was enforced.1 None of them was allowed to know the colour of her own eyes. Everybody could see the colour of the eyes of the others, but there were no mirrors or other reflective surfaces on which to check one’s own appearance. It was also strictly forbidden to ask somebody else to reveal the colour of one’s eyes. The ironic fact is that every one of them had green eyes. Each of them could see that all her companions were green-eyed, but she was in doubt about herself. Another peculiarity of the Amazons was that they were all proficient logicians: They could make the most complex reasoning without error. One day the goddess Artemis came to the village and announced: ‘I decided to give a golden bow to every one of you who has green eyes. To apply for the prize you will need to paint your front door green before midnight of any day. Then, the following morning, I will come to check whether your eyes are indeed green. If they are, you will receive the price. But be warned, there will be no tolerance for cheaters: If your eyes turn out to be of a different colour, I will strike you down with one of my arrows. I am quite sure that I didn’t come here in vain, because I can see that at least one of you has green eyes.’ My question to you is: Can you predict how the Amazons behaved. Did any of them paint her door green, and when did they do it? The solution is revealed at the end of the article. 1This is a variant of the cheating wives [5] (or husbands [6]) puzzle, also known as the muddy children puzzle [2]. REFLECTIONS ON TYPE THEORY, λ-CALCULUS, AND THE MIND Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday Copyright c © 2007 by Venanzio Capretta

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Breaking the Loop: Recursive Proofs for Coinductive Predicates in Fibrations

The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of up-to techniques. This approach lifts the burden to guess invariants, like bisimulation relations, beforehand. Rather, they allow one to start with the soug...

متن کامل

Guarded Dependent Type Theory with Coinductive Types

We present guarded dependent type theory, gDTT, an extensional dependent type theory with a ‘later’ modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to ensure the productivity of recursive definitions in a modular, type based, way. Clock quantifiers are used for controlled elimination of the later modality and fo...

متن کامل

Computational Soundness of Coinductive Symbolic Security under Active Attacks

In Eurocrypt 2010, Miccinacio initiated an investigation of cryptographically sound, symbolic security analysis with respect to coinductive adversarial knowledge, and demonstrated that under an adversarially passive model, certain security criteria (e.g. indistinguishability) may be given a computationally sound symbolic characterization, without the assumption of key acyclicity. Left open in h...

متن کامل

Coinductive Proofs for Basic Real Computation

We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these two representations to show the adequacy of signed digit stream representation. We also show a coinductive proof for the correctness of a corecursive program for the average function with regard to the signed digit stre...

متن کامل

ar X iv : 1 41 1 . 43 80 v 3 [ cs . L O ] 2 8 Ja n 20 15 An infinitary model of linear logic

In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint operator Y as a Conway operator alternatively defined in an inductive or a coinductive way. We then extend the relational semantics with a notion of color or pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007